当前位置：
首页 资源下载
搜索资源 - connected component
搜索资源列表
-
0下载：
递归算法求一个有向图的强连通分量，输入格式如压缩包中data4.txt，第一行为顶点个数。输出到result.txt中。-recursive algorithm for a directed graph strongly connected component, the input format such as compression package data4.txt. the first acts of the number of vertices. Result.txt exported
-
-
0下载：
有向图的强连通的分量的实现-directed graph strongly connected component of the realization
-
-
0下载：
数据结构中的求强连通分量的源程序，用vc6.0来编写-data structure for the strongly connected component of the source used to prepare vc6.0
-
-
0下载：
该算法为领域标记程序，可以检测 blob 区域-the algorithm for field marking procedures can detect regional blob
-
-
0下载：
nvidia CUDA 2.0 SDK
中文版本,翻译率大概为95％-nvidia CUDA 2.0 SDK Chinese version, the translation rate of about 95
-
-
0下载：
连通图程序源码,实验环境是Linux 欢迎下载-connected component labeling algorithm the environment of experiment is linux welcome to download
-
-
0下载：
TFlightJoyStick is developed as part of the Aircraft library from Diprode. The question how to use a joystick with Delphi is a regular one. This Freeware Component should provide a total solution for anyone that needs to use a Joystick.
TFlightJ
-
-
0下载：
F# Connected Component Union-Find Algorithm from MSDN Developer
-
-
0下载：
ZylGPSReceiver is a Delphi / C++Builder component collection that communicates with a serial GPS receiver.
It works with any NMEA compatible receiver connected to one of the serial ports. You can use it also with USB and Bluetooth devices, because
-
-
0下载：
复杂背景下车牌定位与字符分割算法研究
本文在简要介绍国内外车牌识别技术研究现状的基础上，对车牌定位算法及字符分
割算法进行了深入的研究，主要完成以下工作：
车牌的定位算法设计阶段，本文提出了一种综合利用车牌多重特征的定位算法。该
算法充分利用了车牌的纹理，色彩及车牌长宽比等特征。经过水平梯度化，二值化，滤
波，区域连通、连通域标记筛选，色彩匹配等几个步骤，最终达到了复杂背景下汽车牌
照的定位。-Complex background license plate loc
-
-
0下载：
克鲁斯卡尔算法(Kruskal s algorithm)是两个经典的最小生成树算法的较为的该算法的代码进行了综合和改进，把各个版本存在的简单理解的一个。本程序对网上的很多版本错误都进行了改正，并用多个例子进行测试。欢迎大家找出错误。-Kruskal s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it
-
-
0下载：
建立一个图，实现连通图的，输出一个最大连通图的连通分量-A graph, connectivity graph, the output of one of the largest connected component of graph connectivity
-
-
0下载：
标记方法的几篇经典文献，我觉得总结性比较好，上传在此，希望大家喜欢-Markers of several classic literature, I feel better summary, upload here, hope you like
-
-
0下载：
image processing getting max connected component of an image
-
-
0下载：
用VC++编写的求双连通分支的程序，这个程序的算法是《算法引论—一种创造性方法》中的算法-Written by VC++ double-connected component of the program requirements, the program' s algorithm is the " Introduction to Algorithms- A creative approach" in the algorithm
-
-
0下载：
使用opencv去掉二值化图像中黑色面积较小的连通域。
程序中语句 tmparea = fabs(cvContourArea(contour)) 可以得到当前连通域的面积，当此面积小于阈值时对其填充为白色。
rect = cvBoundingRect(contour,0) 得到的是框住连通域的最小矩形，对矩形中的黑色部分将其填充为白色，但是这样的话，连通域6和4两个连通域被填充成了白色的矩形，这显然不符合我们的要求，这样就要判断此连通域是黑色联通域还是白色连通域，采用的方法是测试矩
-
-
0下载：
显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量-Shows the adjacency matrix, adjacency table, depth-first traversal, breadth-first traversal, minimum spanning tree PRIM algorithm, minimum spanning tree KRUSCAL algorithm, graph conn
-
-
1下载：
本文件包含连通区域标记以及面积测量的matlab源代码-This document contains the connected component labeling, and area measurement of the source code matlab
-
-
0下载：
poj上1112题，综合性较强，先求出补图，再求每个连通分量的两种类别的点数，最后dp-poj on the 1112 title, more integrated, first find the complement, and then find each connected component of the two categories of points, the last dp
-
-
0下载：
代码1：优化过的Otsu程序，纯C编写
代码2：优化过的中值滤波程序，纯C编写
代码3：快速连通域检测程序，用于团块分析，纯C编写
代码4：MeanShift图像分割程序，纯c编写
代码5：WaterShed图像分割程序，c++编写，可直接运行，看分割效果-Code 1: The optimized program Otsu, pure C
code 2: The optimized procedure median filter, pure C
code 3: Fa
-
